Achieving Queue-Length Stability Through Maximal Scheduling in Wireless Networks
نویسندگان
چکیده
We address the question of attaining stability guarantees through distributed scheduling in wireless networks. We consider a simple, local information based, distributed scheduling strategy, maximal scheduling, and prove that it attains a guaranteed fraction of the maximum stability region. By considering the notion of queue-length stability, we strengthen existing rate stability results for maximal scheduling. The queuelength stability guarantees provided by maximal scheduling can differ across sessions, and depends on the “interference degree” in the two-hop neighborhood of the session.
منابع مشابه
Queue-Based Adaptive Duty Cycle Control for Wireless Sensor Networks
This paper proposes a control-based approach to duty cycle adaptation for wireless sensor networks. The proposed method controls duty cycle through queue management in order to achieve high performance under variable traffic rates. To have energy efficiency while minimizing the delay, we design a feedback controller, which adapts sleeping interval time to traffic change dynamically by constrain...
متن کاملA virtual queue-based back-pressure scheduling algorithm for wireless sensor networks
In this paper, we design a new virtual queue-based back-pressure scheduling algorithm (VBR) for achieving significant delay reduction in wireless sensor networks (WSN). Our algorithm design comes from an observation that classical back-pressure scheduling algorithm usually needs a long period of time to form a queue backlog-based gradient in a network, which decreases towards the sink in the ne...
متن کاملQueue Length Stability of Maximal Greedy Schedules in Wireless Networks
Abstract— We consider wireless networks with interference constraints. The network consists of a set of links and a set of users who generate packets that traverse these links. Each user is associated with a route consisting of a sequence of links. The links are subject to the usual interference constraints: (i) if link l interferes with link k, then link k also interferes with link l, and (ii)...
متن کاملControl of wireless networks with flow level dynamics under constant time scheduling
We consider a network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the control problem in low load and high load regimes. In the low load regime, we show that the network can be stabilized by a regulated maximal scheduling policy considering flow level dynamics if the offered load satisfies a constrainin...
متن کاملDistributed Optimal Channel Access in Cognitive Radio Networks
Cognitive radio networks (CRNs) let unlicensed or secondary users (SUs) access licensed spectra, improving wireless resource utilization and addressing the problem of spectrum shortage. SUs are allowed spectrum access only when they don’t cause unacceptable levels of interference to licensed or primary users (PUs). Although throughput-optimal algorithms based on the well-known maximal-weight sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006